Individual Stability in Hedonic Coalition Formation

نویسنده

  • Szilvia Pápai
چکیده

I study the existence of Nash-stable and individually stable coalition structures in hedonic coalition formation games, where a coalition structure is a partition of the players, and players strictly rank the coalitions to which they belong. The hedonic coalition formation game in which all coalitions are feasible is viewed as a general model, and more specific models, such as the marriage and roommate models, are defined by the set of feasible coalitions, which are assumed to include all singletons. In this paper I give characterizations, in terms of restrictions on feasible coalitions, of the hedonic coalition formation models which are Nash-stable and individually stable, respectively, in the sense that at least one such coalition structure exists for all preference profiles in the given model. In particular, the result for Nash-stability is that coalitions of size two cannot be feasible, while for individual stability odd single-lapping cycles, together with certain disjoint subsets of the coalitions in the cycle, are not feasible. Based on these characterizations, sufficient conditions for the Nash-stability and individual stability of preference profiles are also provided. ∗I would like to thank Rajat Deb, Gabrielle Demange, Federico Echenique, and Lars Ehlers for their comments, as well as the participants of the 2006 Wallis Institute Mini Conference. †Department of Economics, Concordia University, 1455 de Maisonneuve Blvd. West, Montreal, Quebec H3G 1M8, Canada; e-mail: [email protected]

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Fractional Hedonic Games: Individual and Group Stability

Coalition formation provides a versatile framework for analyzing cooperative behavior in multi-agent systems. In particular, hedonic coalition formation has gained considerable attention in the literature. An interesting class of hedonic games recently introduced by Aziz et al. [3] are fractional hedonic games. In these games, the utility an agent assigns to a coalition is his average valuation...

متن کامل

Random Paths to Stability in Hedonic Coalition Formation

We study the myopic stability of hedonic coalition formation. Myopic stability means that for each unstable coalition structure there exists a sequence of myopic blockings that leads to a stable coalition structure. The main result is a characterization of the hedonic coalition formation models which are myopically stable whenever a stable coalition structure exists. One interesting implication...

متن کامل

Individual-based stability in hedonic games depending on the best or worst players

We consider classes of hedonic games in which each player’s preferences over coalition structures are induced by the best player (Band B-hedonic games) or the worst player (Wand W-hedonic games) in his coalition. For these classes, which allow for concise representation, we analyze the computational complexity of deciding the existence of and computing individually stable, Nash stable, and indi...

متن کامل

Hedonic coalition formation games: A new stability notion

This paper studies hedonic coalition formation games where each player’s preferences rely only upon the members of her coalition. A new stability notion under free exit-free entrymembership rights, referred to as strong Nash stability, is introducedwhich is stronger than both core and Nash stabilities studied earlier in the literature. Strong Nash stability has an analogue in non-cooperative ga...

متن کامل

ar X iv : 1 10 5 . 18 24 v 2 [ cs . G T ] 3 D ec 2 01 1 Individual - based stability in hedonic games depending on the best or worst players ∗

We consider hedonic coalition formation games in which each player has preferences over the other players and his preferences over coalition structures are based on the best player (B-/B-hedonic games) or the worst player (W /W-hedonic games) in his coalition. We show that for B-hedonic games, an individually stable partition is guaranteed to exist and can be computed efficiently. Similarly, th...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007